#include<bits/stdc++.h>
#define sd(n) scanf("%d",&n) 
#define sld(n) scanf("%lld",&n)
#define pd(n) printf("%d", (n))
#define pld(n) printf("%lld", n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
const int N = 2e5;
#define INF 0x7fffffff
typedef long long int ll;
using namespace std;
//----------------------------------------------------------------------------//
int a[26];
void solve()
{
	string s1;
	cin >> s1;
	int mx = 0;
	char ans;
	for (auto& k : s1) a[k - 'a']++;
	for (auto& k : s1)
	{
		if (mx < a[k - 'a']) mx = a[k - 'a'], ans=k;
	}
	cout << ans << '\n' << mx << '\n';
}

int main()
{
	int T = 1;
	//sd(T);
	while (T--)
	{
		solve();
	}
	return 0;
}